/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 86183
 * Date: 2024-01-20
 * Time: 18:58
 */
/*
public class Test {
    public static void main(String[] args) {
        BinaryTree binaryTree=new BinaryTree();
        BinaryTree.TreeNode root=binaryTree.createTree();
        System.out.println("前序遍历");
        binaryTree.preOrder(root);
        System.out.println();
        System.out.println("中序遍历");
        binaryTree.inOrder(root);
        System.out.println();
        System.out.println("后序遍历");
        binaryTree.postOrder(root);
        System.out.println();
        System.out.print("节点个数:");
        binaryTree.size(root);
        System.out.println(BinaryTree.nodeSize);
        System.out.println(binaryTree.size2(root));
        System.out.print("叶子节点个数:");
        binaryTree.getLeafNodeCount1(root);
        System.out.println(BinaryTree.leafSize);
        System.out.println(binaryTree.getLeafNodeCount2(root));
        System.out.println("======================");
        System.out.println(binaryTree.getKLevelNodeCount(root, 3));
        System.out.println("树的高度:");
        System.out.println(binaryTree.getHeight(root));
       BinaryTree.TreeNode node= binaryTree.find(root,'A');
        System.out.println(node.val);
        BinaryTree.TreeNode node2= binaryTree.find(root,'H');
        System.out.println(node2.val);


    }
}
*/
